%0 Book Section
%4 sid.inpe.br/mtc-m21c/2019/03.13.14.03
%2 sid.inpe.br/mtc-m21c/2019/03.13.14.03.24
%@doi 10.1007/978-0-387-34897-1_58
%@isbn 978-1-4757-6671-4
%@isbn 978-0-387-34897-1 (eBook)
%T A dynamic list heuristic for 2D-cutting
%D 1996
%A Lorena, Luiz Antonio Nogueira,
%A Lopes, Fábio Belo,
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%@affiliation Instituto Nacional de Pesquisas Espaciais (INPE)
%E Dolezal, Jaroslav ,
%E Fidler, Jiri,
%B System modelling and optimization: Proceedings of the Seventeenth IFIP TC7 Conference on System Modelling and Optimization, 1995
%I Springer
%P 481-488
%K Cutting Stock, Heuristics, Best-first search, Tabu search.
%X We present a new heuristic for the 2D-cutting problem, called Dynamic List Heuristic (DLH). The objective is to eliminate the combinatorial explosion of the all rectangle combination's type heuristics, maintaining their good results of reduced waste. Algorithm DLH uses a dynamic list of constructed patterns, included and deleted at convenient times. DLH is based on the A * approach, a best-first tree of candidate solutions, and the use of an auxiliary tabu list for alternate best patterns to avoid excessive repetition. The computational tests for some problems of the literature and many random generated problems, confirm good results using microcomputers.
%@language en
%3 lorena_dynamic.pdf